n = int(input())
s = sorted([*map(int,input().split())])
m = -10**10
cnt = 1
for i in range(n-1):
if(s[i] == s[i+1]): cnt += 1
else: m = max(m,cnt); cnt = 1
m = max(cnt,m)
print(m)#include<bits/stdc++.h>
using namespace std;
int main()
{
int ar[1005]= {0};
int n;
cin>>n;
for(int i=0; i<n; i++)
{ int x;
cin>>x;
ar[x]++;
}
sort(ar,ar+1005,greater<int>());
cout<<ar[0]<<endl;
return 0;
}
630C - Lucky Numbers | 1208B - Uniqueness |
1384A - Common Prefixes | 371A - K-Periodic Array |
1542A - Odd Set | 1567B - MEXor Mixup |
669A - Little Artem and Presents | 691B - s-palindrome |
851A - Arpa and a research in Mexican wave | 811A - Vladik and Courtesy |
1006B - Polycarp's Practice | 1422A - Fence |
21D - Traveling Graph | 1559B - Mocha and Red and Blue |
1579C - Ticks | 268B - Buttons |
898A - Rounding | 1372B - Omkar and Last Class of Math |
1025D - Recovering BST | 439A - Devu the Singer and Churu the Joker |
1323A - Even Subset Sum Problem | 1095A - Repeating Cipher |
630F - Selection of Personnel | 630K - Indivisibility |
20B - Equation | 600B - Queries about less or equal elements |
1015A - Points in Segments | 1593B - Make it Divisible by 25 |
680C - Bear and Prime 100 | 1300A - Non-zero |